A Complete Axiomatization of Computer Arithmetic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Complete Axiómatization of Computer Arithmetic

We define an axiom system for rounded arithmetic to be complete if we can recover from any model of the axioms the exact algebra from whence it came. A complete set of axioms is given for rounded addition and multiplication. In some circles of numerical analysis, there is a deep suspicion that some of the scientific and engineering calculations being done by computer do not correspond to extern...

متن کامل

A complete axiomatization forML!1

In this paper we present a completeness theorem for the innnitary modal logic ML !1. The proof is based on the new notion of an innnitary modal consistency property. 1

متن کامل

A Complete Axiomatization of Real-Time Processes

Once strictly the province of assembly-language programmers, real-time computing has developed into an area of important theoretical interest. Real-time computing incorporates all of the theoretical problems encountered in concurrent processing and introduces the additional complexity of accounting for the temporal behavior of processes. In this paper we investigate two problems in the theory o...

متن کامل

On the Axiomatization of Interval Arithmetic

We investigate some abstract algebraic properties of the system of intervals with respect to the arithmetic operations and the relation inclusion and derive certain practical consequences from these properties. In particular, we discuss the use of improper intervals (in addition to proper ones) and of midpoint-radius presentation of intervals. This work is a theoretical introduction to interval...

متن کامل

A Complete Axiomatization for Blocks World

Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving justification for its soundness and completeness. In this paper, we model a state of BW by a finite collection of finite chains, and call the theory of all these structures BW theory. We present seven simple axioms and pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1984

ISSN: 0025-5718

DOI: 10.2307/2007607